#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<bits/stdc++.h>
#include<unordered_set>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VD vector<double>
#define VVD vector<VD >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
        int x=0,f=1;char ch=getchar();
        while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
        while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
        return x*f;
}

template<typename T>
inline void read(T &x){
        x=0;T f=1;char ch;
        do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
        do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

void extgcd(ll a,ll b,ll &x,ll &y){
	if(b==0){
		x=1;y=0;
		return;
	}
	extgcd(b,a%b,y,x);
	y-=(a/b)*x;
}

int dat[300005];
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	int n=read();
	for(int i=0;i<n;i++)dat[i]=read();
	int a=0,b=1,k=0;
	while(a<n&&b<n&&k<n){
		if(dat[(a+k)%n]==dat[(b+k)%n])++k;
		else if(dat[(a+k)%n]<dat[(b+k)%n]){
			b=b+k+1;
			k=0;
		}else {a=a+k+1;k=0;}
		if(a==b)++a;
	}
	int res=min(a,b);
	for(int i=0;i<n;i++){
		printf("%d ",dat[(res+i)%n]);
	}printf("\n");
}